The Truck Platooning Routing Optimization Model Based on Multicommodity Network Flow Theory

نویسندگان

چکیده

Truck platooning has been identified as an emerging and promising operational technology with the advantages of fuel consumption savings carbon emissions reductions. We formulate truck routing optimization problem a multi-commodity network flow from transportation scheduling perspective. Based on generated through reduction aerodynamic drag by formation platooning, route each is also set to be decision variable needing settlement facilitate maximize savings. Considering detour costs, we construct model minimum overall system objective. The output could both reflect composition link directly show routings truck. To explore impact restrictions number trucks in savings, road networks are constructed solved commercial solver CPLEX. Compared individual trucks, 8% or 12% achieved, respectively, being restricted not platooning. different rates following performance terms total cost, sensitivity analysis conducted. results that ideal plan can obtained proposed model, study provides theoretical reference for promotion application

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy optimization based on routing protocols in wireless sensor network

Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...

متن کامل

Multicommodity Network Flow Problems

In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...

متن کامل

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

A global router based on a multicommodity flow model

The paper describes a new global router applicable for any object with a defined channel structure. This router can be used for the routing of chips and boards with rectilinear or nonrectilinear channel topology in a multilayer environment. This makes it more universal than other known global routers. The router is based on a multicommodity flow model in the graph form with hierarchical cost fu...

متن کامل

Multicommodity Flow Algorithms for Buffered Global Routing

In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer and wire congestion subject to given constraints on routing area (wirelength and number of buffers) and sink delays. Our algorithm allows computing the tradeof...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Advanced Transportation

سال: 2023

ISSN: ['0197-6729', '2042-3195']

DOI: https://doi.org/10.1155/2023/6906655